package com.huawei.tree.binary_sort_tree;

//测试类
public class Test {
    public static void main(String[] args) {
        int[] array = {7,3,10,12,5,1,9};
        BinarySortTree binarySortTree = new BinarySortTree();
        //循环添加节点到二叉排序树
        for (int j : array) {
            binarySortTree.add(new Node(j));
        }
        //中序遍历二叉排序树
        System.out.println("中序遍历二叉排序树");
        binarySortTree.midOrder();
        //测试删除节点

    }
}
